Chip firing and all-terminal network reliability bounds
نویسندگان
چکیده
منابع مشابه
Lower Bounds for Two-Terminal Network Reliability
One measure of two-terminal network reliability, termed probabilistic connectedness, is the probability that two specified communication centers can communicate. A standard model of a network is a graph in which nodes represent communications centers and edges represent links between communication centers. Edges are assumed to have statistically independent probabilities of failing and nodes ar...
متن کاملLower bounds on two-terminal network reliability
Computing the probability that two nodes in a probabilistic network are connected is a wellknown computationally difficult problem. Two strategies are devised for obtaining lower bounds on the connection probability for two terminals. The first improves on the Kruskal-Katona bound by using efficient computations of small pathsets. The second strategy employs efficient algorithms for finding edg...
متن کاملEstimating All-Terminal Network Reliability Using a Neural Network
The exact calculation of all-terminal network reliability is an NP-hard problem, with computational effort growing exponentially with the number of nodes and links in the network. Because of the impracticality of calculating allterminal network reliability for networks of moderate to large size, Monte Carlo simulation methods to estimate network reliability and upper and lower bounds to bound r...
متن کاملFast computation of bounds for two-terminal network reliability
In this paper, an algorithm for the fast computation of network reliability bounds is proposed. The evaluation of the network reliability is an intractable problem for very large networks, and hence approximate solutions based on reliability bounds have assumed importance. The proposed bounds computation algorithm is based on an efficient BDD representation of the reliability graph model and a ...
متن کاملAn Improved General Upper Bound for All-Terminal Network Reliability
The exact calculation of all-terminal network reliability is an NP-hard problem, precluding its use in the design of optimal network topologies for problems of realistic size. This paper presents an improved upper bound for allterminal network reliability that is significantly more general than previously published bounds as it allows arcs of different reliabilities. The bound is calculated in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2009
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2009.05.003